Performance scaling of the quantum Fourier transform with defective rotation gates

نویسندگان

  • Yun Seong Nam
  • Reinhold Blümel
چکیده

Addressing Landauer’s question concerning the influence of static gate defects on quantum information processor performance, we investigate analytically and numerically the case of the quantum Fourier transform (QFT) with defective controlled rotation (CROT) gates. Two types of defects are studied, separately and in combination: systematic and random. Analytical scaling laws of QFT performance are derived with respect to the number of qubits n, the size δ of systematic defects, and the size ǫ of random defects. The analytical results are in excellent agreement with numerical simulations. In addition, we present an unexpected result: The performance of the defective QFT does not deteriorate with increasing n, but approaches a constant that scales in ǫ. We derive an analytical formula that accurately reproduces the ǫ scaling of the performance plateaus. Overall, we observe that the CROT gates may exhibit static and random defects of the order of 30% and larger, and still result in satisfactory QFT performance. Thus we answer Landauer’s question in the case of the QFT: far from being lethal, the QFT can tolerate tremendous static gate defects and still perform its function. The extraordinary robustness of the QFT with respect to static gate defects displayed in our numerical and analytical calculations should be a welcome boon for laboratory and industrial realizations of quantum circuitry.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Halving the cost of quantum addition

We improve the number of T gates needed to perform an n-bit adder from 8n + O(1) [1, 6, 8] to 4n+O(1). We do so via a “temporary logical-AND” construction, which uses four T gates to store the logical-AND of two qubits into an ancilla and zero T gates to later erase the ancilla. Temporary logical-ANDs are a generally useful tool when optimizing T-counts. They can be applied to integer arithmeti...

متن کامل

A new shape retrieval method using the Group delay of the Fourier descriptors

In this paper, we introduced a new way to analyze the shape using a new Fourier based descriptor, which is the smoothed derivative of the phase of the Fourier descriptors. It is extracted from the complex boundary of the shape, and is called the smoothed group delay (SGD). The usage of SGD on the Fourier phase descriptors, allows a compact representation of the shape boundaries which is robust ...

متن کامل

Reversible addition circuit using one ancillary bit with application to quantum computing

Most of the work on implementing arithmetic on a quantum computer has borrowed from results in classical reversible computing (e.g. [VBE95], [BBF02],[DKR+04]). These quantum networks are inherently classical, as they can be implemented with only the Toffoli gate. Draper [D00] proposed an inherently “quantum” network for addition based on the quantum Fourier transform. His approach has the advan...

متن کامل

Design and Synthesis of Efficient Circuits for Quantum Computers

The recent advances in the field of experimental construction of quantum computers with increased fidelity components shows that large-scale machines based on the principles of quantum physics are likely to be realized in the near future. As the size of the future quantum computers will be increased, efficient quantum circuits and design methods will gradually gain practical interest. The contr...

متن کامل

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Quantum Information & Computation

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2015